package ink.lovejinhu.leetcodeMatch;

import java.util.HashSet;

/**
 * @author jinhu
 * created 2021-08-01 10:32
 */
public class Solution_5834 {
    /**
     * 三除数
     *
     * @param n
     * @return
     */
    public boolean isThree(int n) {
        if (n <= 1) return false;
        HashSet<Integer> res = new HashSet<>();
        for (int i = 1; i <= n / 2; i++) {
            if (n % i == 0) {
                res.add(i);
                res.add(n / i);

            }
        }
        return res.size() == 3;
    }

    public static void main(String[] args) {
        double sqrt = Math.sqrt(3);
        System.out.println(sqrt);
    }
}
